Positivity of the weights of extended Clenshaw-Curtis quadrature rules
نویسندگان
چکیده
منابع مشابه
Positivity of the Weights of Extended Gauss-Legendre Quadrature Rules
We show that the weights of extended Gauss-Legendre quadrature rules are all positive.
متن کاملStochastic Discrete Clenshaw-Curtis Quadrature
The partition function is fundamental for probabilistic graphical models—it is required for inference, parameter estimation, and model selection. Evaluating this function corresponds to discrete integration, namely a weighted sum over an exponentially large set. This task quickly becomes intractable as the dimensionality of the problem increases. We propose an approximation scheme that, for any...
متن کاملIs Gauss Quadrature Better than Clenshaw-Curtis?
We compare the convergence behavior of Gauss quadrature with that of its younger brother, Clenshaw–Curtis. Seven-line MATLAB codes are presented that implement both methods, and experiments show that the supposed factor-of-2 advantage of Gauss quadrature is rarely realized. Theorems are given to explain this effect. First, following O’Hara and Smith in the 1960s, the phenomenon is explained as ...
متن کاملThe kink phenomenon in Fejér and Clenshaw-Curtis quadrature
The Fejér and Clenshaw–Curtis rules for numerical integration exhibit a curious phenomenon when applied to certain analytic functions. When N (the number of points in the integration rule) increases, the error does not decay to zero evenly but does so in two distinct stages. For N less than a critical value, the error behaves like O( −2N ), where is a constant greater than 1. For these values o...
متن کاملProbabilistic Inference with Stochastic Discrete Clenshaw-Curtis Quadrature
The partition function is fundamental for probabilistic graphical models—it is required for inference, parameter estimation, and model selection. Evaluating this function corresponds to discrete integration, namely a weighted sum over an exponentially large set. This task quickly becomes intractable as the dimensionality of the problem increases. We propose an approximation scheme that, for any...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1993
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1993-1176710-2